Morphing the Hugin and Shenoy-Shafer Architectures
نویسندگان
چکیده
The Hugin and Shenoy–Shafer architectures are two variations on the jointree algorithm, which exhibit different tradeoffs with respect to efficiency and query answering power. The Hugin architecture is more time–efficient on arbitrary jointrees, avoiding some redundant computations performed by the Shenoy–Shafer architecture. This efficiency, however, comes at the price of limiting the number of queries the Hugin architecture is capable of answering. In this paper, we present a simple algorithm which retains the efficiency of the Hugin architecture and enjoys the query answering power of the Shenoy–Shafer architecture.
منابع مشابه
A Comparison of Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer Architectures for Computing Marginals of Probability Distributions
In the last decade, several architectures have been proposed for exact computation of marginals using local computation. In this paper, we compare three architectures—Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer—from the perspective of graphical structure for message propagation, message-passing scheme, computational efficiency, and storage efficiency.
متن کاملSome Improvements to the Shenoy-Shafer and Hugin Architectures for Computing Marginals
The main aim of this paper is to describe two modifications to the Shenoy–Shafer architecture with the goal of making it computationally more efficient in computing marginals of the joint valuation. We also describe a modification to the Hugin architecture. Finally, we briefly compare the traditional and modified architectures by solving a couple of small Bayesian networks, and conclude with a ...
متن کاملFast-Division Architecture for Dempster-Shafer Belief Functions
Given a number of Dempster-Shafer belief functions there are different architectures which allow to do a compilation of the given knowledge. These architectures are the Shenoy-Shafer Architecture, the Lauritzen-Spiegelhalter Architecture and the HUGIN Architecture. We propose a new architecture called ”Fast-Division Architecture” which is similar to the former two. But there are two important a...
متن کاملA Time and Space Efficient Junction Tree Architecture
The Hugin and Shafer-Shenoy architectures are variations on the junction tree algorithm which tradeoff space and time complexities in different ways. The Hugin architecture is faster than that of Shafer-Shenoy but at the cost of a greater space complexity. This paper presents a new architecture which, in the cases where there exist relatively large vertices of the junction tree with high degree...
متن کاملSolving Influence Diagrams using HUGIN, Shafer-Shenoy and Lazy Propagation
In this paper we present three different architectures for the evaluation of influence diagrams: HUGIN, Shafer-Shenoy (S-S), and Lazy Propagation (LP). HUGIN and LP are two new architectures introduced in this paper. The computational complexity using the three architectures are compared on the same structure, the LImited Memory Influence Diagram (LIMID), where only the requisite information fo...
متن کامل